Greedy solution of ill-posed problems: error bounds and exact inversion
نویسندگان
چکیده
منابع مشابه
Greedy Solution of Ill-Posed Problems: Error Bounds and Exact Inversion
The orthogonal matching pursuit (OMP) is a greedy algorithm to solve sparse approximation problems. Sufficient conditions for exact recovery are known with and without noise. In this paper we investigate the applicability of the OMP for the solution of ill-posed inverse problems in general and in particular for two deconvolution examples from mass spectrometry and digital holography respectivel...
متن کاملIll-Posed and Linear Inverse Problems
In this paper ill-posed linear inverse problems that arises in many applications is considered. The instability of special kind of these problems and it's relation to the kernel, is described. For finding a stable solution to these problems we need some kind of regularization that is presented. The results have been applied for a singular equation.
متن کاملGreedy Tikhonov regularization for large linear ill-posed problems
Several numerical methods for the solution of large linear ill-posed problems combine Tikhonov regularization with an iterative method based on partial Lanczos bidiagonalization of the operator. This paper discusses the determination of the regularization parameter and the dimension of the Krylov subspace for this kind of methods. A method that requires a Krylov subspace of minimal dimension is...
متن کاملError bounds for extremely ill-conditioned problems
We discuss methods to compute error bounds for extremely ill-conditioned problems. As a model problem we treat matrix inversion. We demonstrate that additive corrections to improve an approximate inverse are useful for ill-conditioned problems, but hardly usable for extremely ill-conditioned problems. Here multiplicative corrections can be used, including the possibility to compute guaranteed e...
متن کاملProbabilistic Solution of Ill-Posed Problems in Computational Vision
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Inverse Problems
سال: 2009
ISSN: 0266-5611,1361-6420
DOI: 10.1088/0266-5611/25/11/115017